Indexing Boolean Expressions

A Analysis and Optimization for Boolean Expression Indexing

BE-Tree is a novel dynamic tree data structure designed to efficiently index Boolean expressions over a high-dimensional discrete space. BE-Tree copes with both high-dimensionality and expressiveness of Boolean expressions by introducing a twophase space-cutting technique that specifically utilizes the discrete and finite domain properties of the space. Furthermore, BE-Tree employs self-adjustm...

Basic Goals: Separation of Concerns Generate efficient code sequences for individual operations Keep it fast and simple: leave most optimizations to later phases Provide clean, easy-to-optimize code IR forms the basis for code optimization and target code generation

Assumptions Intermediate language: RISC-like 3-address code‡ Intermediate Code Generation (ICG) is independent of target ISA Storage layout has been pre-determined Infinite number of registers + Frame Pointer (FP) Q. What values can live in registers? ‡ ILOC: Cooper and Torczon, Appendix A. Strategy 1. Simple bottom-up tree-walk on AST 2. Translation uses only local info: current AST node + chi...

Semantic Indexing Using WordNet Senses

We describe in this paper a boolean Information l~.etrieval system that adds word semantics to the classic word based indexing. Two of the main tasks of our system, namely the indexing and retrieval components, are using a combined wordbased and sense-based approach. The key to our system is a methodology for building semantic representations of open text, at word and collocation level. This ne...

Web personalization using Extended Boolean Operations with Latent Semanti Indexing

BLOSOM: A Framework for Mining Boolean Expressions

We introduce a novel framework, called BLOSOM, for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. We focus on mining the simplest expressions (theminimal generators) for each class. We also propose a closure op...